منابع مشابه
Data Clustring Using A New CGA(Chaotic-Generic Algorithm) Approach
Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...
متن کاملData Clustring Using A New CGA(Chaotic-Generic Algorithm) Approach
Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...
متن کاملSolving Generic Scheduling Problems with a Distributed Genetic Algorithm
This paper describes a Distributed Genetic Algorithm (DGA) which has been used to solve generic scheduling problems. The GA based scheduler allows the user to deene and solve any scheduling problem. It does this using a Scheduling Description Language (SDL). The sort of problem that it might tackle are: job-shop scheduling (JJS), time-tabling, resource sequencing etc. We describe a unique chrom...
متن کاملTackling Car Sequencing Problems Using a Generic Genetic Algorithm Strategy
The car sequencing problem (CarSP) was seen as a challenge to artificial intelligence. The CarSP is a version of the job-shop scheduling problem which is known to be NP-complete. The task in the CarSP is to schedule a given number of cars (of different types) in a sequence to allow the teams in each work station on the assembly line to fit the required options (e.g. radio, sunroof) on the cars ...
متن کاملA Generic Adaptive Multi-Gene-Set Genetic Algorithm (AMGA)
Genetic algorithms have been used extensively in solving complex solution-space search problems. However, certain problems can include multiple sub-problems in which multiple searches through distinct solution-spaces are required before the final solution combining all the sub-solutions is found. This paper presents a generic design of genetic algorithms which can be used for solving complex so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGAda Ada Letters
سال: 2003
ISSN: 1094-3641
DOI: 10.1145/1066404.589462